High relative accuracy through Newton bases
نویسندگان
چکیده
Abstract Bidiagonal factorizations for the change of basis matrices between monomial and Newton polynomial bases are obtained. The total positivity these is characterized in terms sign nodes bases. It shown that computations to high relative accuracy algebraic problems related can be achieved whenever have same sign. Stirling considered particular cases matrices, then collocation Wronskian Touchard performed numerical experimentation confirms accurate solutions obtained when solving using proposed factorizations, instance, calculation their eigenvalues, singular values, inverses, as well solution some linear systems equations associated with matrices.
منابع مشابه
Implicit standard Jacobi gives high relative accuracy
We prove that the Jacobi algorithm applied implicitly on a decomposition A = XDXT of the symmetric matrix A, where D is diagonal, and X is well conditioned, computes all eigenvalues of A to high relative accuracy. The relative error in every eigenvalue is bounded by O(εκ(X)), where ε is the machine precision and κ(X) ≡ ‖X‖2 · ‖X−1‖2 is the spectral condition number of X . The eigenvectors are a...
متن کاملHigh Accuracy Relative Motion of Spacecraft Using Linearized Time-Varying J2-Perturbed Terms
This paper presents a set of linearized equations was derived for the motion, relative to an elliptical reference orbit, of an object influenced by J2 perturbation terms. Approximate solution for simulations was used to compare these equations and the linearized keplerian equations to the exact equations. The inclusion of the linearized perturbations in the derived equations increased the high ...
متن کاملHigher Newton Polygons and Integral Bases
Let A be a Dedekind domain whose field of fractions K is a global field. Let p be a non-zero prime ideal of A, and Kp the completion of K at p. The Montes algorithm factorizes a monic irreducible separable polynomial f(x) ∈ A[x] over Kp, and it provides essential arithmetic information about the finite extensions of Kp determined by the different irreducible factors. In particular, it can be us...
متن کاملAn Orthogonal High Relative Accuracy Algorithm for the Symmetric Eigenproblem
We propose a new algorithm for the symmetric eigenproblem that computes eigenvalues and eigenvectors with high relative accuracy for the largest class of symmetric, definite and indefinite, matrices known so far. The algorithm is divided into two stages: the first one computes a singular value decomposition (SVD) with high relative accuracy, and the second one obtains eigenvalues and eigenvecto...
متن کاملHigh relative accuracy algorithms for the symmetric eigenproblem
In this talk we will review the basic facts and results in the field of high relative accuracy. We will see which algorithms and for which classes of matrices give high relative accuracy. In particular we present an algorithm [Dopico, Molera & Moro, SIAM J. Matrix Anal. Appl., 2003] that delivers high relative accuracy for the largest class of symmetric, definite and indefinite, matrices known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2023
ISSN: ['1017-1398', '1572-9265']
DOI: https://doi.org/10.1007/s11075-023-01588-9